NAS Experiences of Porting CM Fortran Codes to on IBM SP2 and SGI Power Challenge
نویسنده
چکیده
Current Connection Machine (CM) Fortran codes developed for the CM-2 and the CM-5 represent an important class of parallel applications. Several users have employed CM Fortran codes in production mode on the CM-2 and the CM-5 for the last five to six years, constituting a heavy investment in terms of cost and time. With Thinking Machines Corporation's decision to withdraw from the hardware business and with the decommissioning of many CM-2 and CM-5 machines, the best way to protect the substantial investment in CM Fortran codes is to port the codes to High Performance Fortran (HPF) on highly parallel systems. HPF is very similar to CM Fortran and thus represents a natural transition. Conversion issues involved in porting CM Fortran codes on the CM-5 to HPF are presented. In particular, the differences between data distribution directives and the CM Fortran Utility Routines Library, as well as the equivalent functionality in the HPF Library are discussed. Several CM Fortran codes (Cannon algorithm for matrix-matrix multiplication, Linear solver Ax=b, 1-D convolution for 2-D datasets, Laplace's Equation solver, and Direct Simulation Monte Carlo (DSMC) codes have been ported to Subset HPF on the IBM SP2 and the SGI Power Challenge. Speedup ratios versus number of processors for the Linear solver and DSMC code are presented. 1. Subhash Saini is an employee of Computer Sciences Corporation. This workwas funded through NASA contractNAS 2-12961. 117 https://ntrs.nasa.gov/search.jsp?R=19970009599 2017-12-04T21:20:45+00:00Z
منابع مشابه
NAS Experiences of Porting CM Fortran Codes to HPF on IBM SP2 and SGI Power Challenge
Current Connection Machine (CM) Fortran codes developed for the CM-2 and the CM-5 represent an important class of parallel applications. Several users have employed CM Fortran codes in production mode on the CM-2 and the CM-5 for the last five to six years, constituting a heavy investment in terms of cost and time. With Thinking Machines Corporation’s decision to withdraw from the hardware busi...
متن کاملThe NAS Parallel Benchmarks 2.1 Results
We present performance results for version 2.1 of the NAS Parallel Benchmarks (NPB) on the following architectures: • IBM SP2/66 MHz • SGI Power Challenge Array/90 MHz • Cray Research T3D • Intel Paragon "MILl, Inc. This work is supported through NASA Contract NAS 2-14303. tNASA Ames Research Center, Moffett Field, CA, 94035-1000. tSterling Software, Palo Alto, CA. This work is supported throug...
متن کاملHPFStab: An HPF Conjugate Gradient Library
In this paper we present a case study of porting of a Conjugate Gradient library from CM Fortran on a Connection Machine 5 to High Performance Fortran (HPF) on a Silicon Graphics Power Challenge, addressing the issues of portability and performance. Conjugate Gradient Methods (CGM) are a broad category of linear algebra methods for solving the generalized equation A x= b. Through the process of...
متن کاملTulip: A Portable Run-Time System for Object-Parallel Systems1
This paper describes Tulip, a parallel run-time system used by the pC++ parallel programming language. Tulip has been implemented on a variety of scalable, MPP computers including the IBM SP2, Intel Paragon, HP/Convex SPP, Meiko CS2, SGI Power Challenge, and Cray T3D. Tulip differs from other data-parallel RTS implementations; it is designed to support the operations from object-parallel progra...
متن کاملParallelization of NAS Benchmarks for Shared Memory Multiprocessore
This paper presents our experiences of parallelizing the sequential implementation of NAS benchmarks using compiler directives on SGI Origin2000 distributed shared memory (DSM) system. Porting existing applications to new high performance parallel and distributed computing platforms is a challenging task. Ideally, a user develops a sequential version of the application, leaving the task of port...
متن کامل